A Formal Approach to the Compilation of Data-Parallel Languages

In this paper we describe an approach to the compilation of data-parallel programming languages based on a formally deened intermediate language, called V-cal. The calculus V-cal was designed to represent the semantics of data management and control primitives found in data-parallel languages and allows to describe program transformations and optimizations as semantics preserving rewrite rules. Based on V-cal we propose a compiler design that meets two objectives: rstly, it provides a platform that allows compiler writers to construct diierent compilers from a set of implemented transformations and analyses using a modular construction set technique. Secondly, it structures the compilation process into three independent phases to facilitate the reuse of major parts of a compiler when porting it to a diierent target machine or architecture.